A Branch-and-Price Algorithm for the Liner Shipping Network Design Problem
نویسندگان
چکیده
منابع مشابه
A matheuristic for the liner shipping network design problem
We present a matheuristic, an integer programming based heuristic, for the Liner Shipping Network Design Problem. The heuristic applies a greedy construction heuristic based on an interpretation of the liner shipping network design problem as a multiple quadratic knapsack problem. The construction heuristic is combined with an improvement heuristic with a neighborhood defined by the solution sp...
متن کاملA Branch and Cut algorithm for the container shipping network design problem
The network design problem in liner shipping is of increasing importance in a strongly competitive market where potential cost reductions can influence market share and profits significantly. In this paper the network design and fleet assignment problems are combined into a mixed integer linear programming model minimizing the overall cost. To better reflect the real-life situation we take into...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولGlobal intermodal liner shipping network design
This paper presents a holistic analysis for the network design problem of the intermodal liner shipping system. Existing methods for liner shipping network design mainly deal with port-to-port demand. However, most of the demand has inland origins and/or destinations. Thus, it is necessary to cope with inland origin-destination (OD) pairs involving a change in transport mode from inland transpo...
متن کاملBranch-and-Price for a Survivable Network Design Problem
We consider a specific variant of the survivable network design problem suitable to model real world scenarios occurring in the extension of fiber optic networks. In this article, two mixed integer programming models, which can be solved by branch-and-price, are discussed and compared to existing approaches theoretically as well as by a computational study. We further discuss the usage of alter...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SN Operations Research Forum
سال: 2020
ISSN: 2662-2556
DOI: 10.1007/s43069-020-00027-y